Scheduling a project to maximize its net present value: An integer programming approach
نویسندگان
چکیده
منابع مشابه
A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملScheduling Markovian PERT networks to maximize the net present value
We examine project scheduling with net-present-value objective and exponential activity durations, using a continuous-time Markov decision chain. Based on a judicious partitioning of the state space, we achieve a significant performance improvement compared to the existing algorithms.
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1993
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90176-n